Versatile asymmetrical tight extensions

Max-Coloring Paths: Tight Bounds and Extensions

The max-coloring problem is to compute a legal coloring of the vertices of a graph G = (V,E) with vertex weights w such that ∑k i=1 maxv∈Ci w(vi) is minimized, where C1, . . . , Ck are the various color classes. For general graphs, max-coloring is as hard as the classical vertex coloring problem, a special case of the former where vertices have unit weight. In fact, in some cases it can even be...

Lefschetz Extensions, Tight Closure, and Big Cohen-macaulay Algebras

We associate to every equicharacteristic zero Noetherian local ring R a faithfully flat ring extension which is an ultraproduct of rings of various prime characteristics, in a weakly functorial way. Since such ultraproducts carry naturally a non-standard Frobenius, we can define a new tight closure operation on R by mimicking the positive characteristic functional definition of tight closure. T...

Asymmetrical Interactions and Asymmetrical Constraints

The three approaches to too-many-solutions problems discussed in the previous chapter do not treat them as symptomatic of significant generalizations about input-output mappings rather than outputs. Because this systematic challenge to OT is not recognized, previous attacks on these problems, apart from de Lacy's general proposal, see them as an assortment of individual difficult cases and anal...

How asymmetrical before it's asymmetrical?

Versatile Design and Ethical Architecture

Background: Following the spread of dissatisfaction with modern architecture, the machine attitude towards man, and the disregard for human values ​​and human existential dignity, the global movement in support of independence and participation was formed in response to demographic and social realities. Recognized in 1988 as universal design, the movement allowed more people of all levels of ab...